Longitude: Centralized Privacy-Preserving Computation of Users' Proximity
نویسندگان
چکیده
A “friend finder” is a Location Based Service (LBS) that informs users about the presence of participants in a geographical area. In particular, one of the functionalities of this kind of application, reveals the users that are in proximity. Several implementations of the friend finder service already exist but, to the best of our knowledge, none of them provides a satisfactory technique to protect users’ privacy. While several techniques have been proposed to protect users’ privacy for other types of spatial queries, these techniques are not appropriate for range queries over moving objects, like those used in friend finders. Solutions based on cryptography in decentralized architectures have been proposed, but we show that a centralized service has several advantages in terms of communication costs, in addition to support current business models. In this paper, we propose a privacy-aware centralized solution based on an efficient three-party secure computation protocol, named Longitude. The protocol allows a user to know if any of her contacts is close-by without revealing any location information to the service provider. The protocol also ensures that user-defined minimum privacy requirements with respect to the location information revealed to other buddies are satisfied. Finally, we present an extensive experimental work that shows the applicability of the proposed technique and the advantages over alternative proposals.
منابع مشابه
A centralized privacy-preserving framework for online social networks
There are some critical privacy concerns in the current online social networks (OSNs). Users' information is disclosed to different entities that they were not supposed to access. Furthermore, the notion of friendship is inadequate in OSNs since the degree of social relationships between users dynamically changes over the time. Additionally, users may define similar privacy settings for their f...
متن کاملP2P collaborative filtering with privacy
With the evolution of the Internet and e-commerce, collaborative filtering (CF) and privacy-preserving collaborative filtering (PPCF) have become popular. The goal in CF is to generate predictions with decent accuracy, efficiently. The main issue in PPCF, however, is achieving such a goal while preserving users’ privacy. Many implementations of CF and PPCF techniques proposed so far are central...
متن کاملپروتکل کارا برای جمع چندسویه امن با قابلیت تکرار
In secure multiparty computation (SMC), a group of users jointly and securely computes a mathematical function on their private inputs, such that the privacy of their private inputs will be preserved. One of the widely used applications of SMC is the secure multiparty summation which securely computes the summation value of the users’ private inputs. In this paper, we consider a secure multipar...
متن کاملPrivacy-Preserving Distributed Profile Matching in Proximity- based Mobile Social Networks
The Profile matching means that 2 users scrutiny their personal profiles and is usually the primary step towards effective PMSN. It, however, conflicts with users’ growing privacy issues regarding revealing their personal profiles to finish strangers before deciding to move with them Our protocols modify 2 users to perform profile matching while not revealing any data regarding their profiles o...
متن کاملPrivacy Preserving Collaborative Filtering from Asymmetric Randomized Encoding
Collaborative filtering is a famous technique in recommendation systems. Yet, it requires the users to reveal their preferences, which has undesirable privacy implications. Over the years, researchers have proposed many privacy-preserving collaborative filtering (PPCF) systems using very different techniques for different settings, ranging from adding noise to the data with centralized filterin...
متن کامل